Densities with Gaussian Tails

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modified Divergences for Gaussian Densities

Multivariate Gaussian densities are pervasive in pattern recognition and machine learning. A central operation that appears in most of these areas is to measure the difference between two multivariate Gaussians. Unfortunately, traditional measures based on the Kullback–Leibler (KL) divergence and the Bhattacharyya distance do not satisfy all metric axioms necessary for many algorithms. In this ...

متن کامل

Weighted likelihood ratio scores for evaluating forecast densities in tails

We propose and evaluate several new scoring rules based on likelihood ratios, for comparing forecast densities in the context of VaR modelling and expected loss estimation. Our approach is motivated by the observation that existing scoring rules tend to favour fat-tailed models when compared with thin-tailed models. Rather than restricting the weight functions, we impose some restrictions on th...

متن کامل

Predicting Conditional Probability Densities with the Gaussian Mixture - RVFL Network

The incorporation of the Random Vector Functional Link (RVFL) concept into mixture models for predicting conditional probability densities achieves a considerable speed-up of the training process. This allows the creation of a large ensemble of predictors, which results in an improvement in the generalization performance .

متن کامل

Estimating Gaussian Mixture Densities with EM – A Tutorial

Expectation Maximization (EM) [4, 3, 6] is a numerical algorithm for the maximization of functions of several variables. There are several tutorial introductions to EM, including [8, 5, 2, 7]. These are excellent references for greater generality about EM, several good intuitions, and useful explanations. The purpose of this document is to explain in a more self-contained way how EM can solve a...

متن کامل

An Analysis of Turbo Decoding with Gaussian Densities

We provide an analysis of the turbo decoding algorithm (TDA) in a setting involving Gaussian densities. In this context, we are able to show that the algorithm converges and that somewhat surprisingly though the density generated by the TDA may differ significantly from the desired posterior density, the means of these two densities coincide.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the London Mathematical Society

سال: 1993

ISSN: 0024-6115

DOI: 10.1112/plms/s3-66.3.568